A simple approximation algorithm for the internal Steiner minimum tree
نویسنده
چکیده
For a metric graph G = (V,E) and R ⊂ V , the internal Steiner minimum tree problem asks for a minimum weight Steiner tree spanning R such that every vertex in R is not a leaf. This note shows a simple polynomial-time 2ρapproximation algorithm, in which ρ is the approximation ratio for the Steiner minimum tree problem. The result improves the approximation ratio 2ρ+ 1 in [3].
منابع مشابه
(1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree
Selected-internal Steiner minimum tree problem is a generalization of original Steiner minimum tree problem. Given a weighted complete graph G = (V,E) with weight function c, and two subsets R ′ ( R ⊆ V with |R − R ′ | ≥ 2, selected-internal Steiner minimum tree problem is to find a Steiner minimum tree T of G spanning R such that any leaf of T does not belong to R ′ . In this paper, suppose c ...
متن کاملApproximating the selected-internal Steiner tree
In this paper, we consider a variant of the well-known Steiner tree problem. Given a complete graph G = (V, E) with a cost function c : E → R and two subsets R and R satisfying R ⊂ R ⊆ V , a selected-internal Steiner tree is a Steiner tree which contains (or spans) all the vertices in R such that each vertex in R cannot be a leaf. The selected-internal Steiner tree problem is to find a selected...
متن کاملOn the Value of a Random Minimum Weight Steiner Tree
Given an arbitrary weighted graph with a fixed set of vertices, the Steiner tree problem is the task of finding a minimum weight subtree containing all these vertices, where the weight of a tree is the sum of the weights of the edges it contains. Steiner trees are very well studied objects in combinatorial optimization; the interest is motivated by several practical problems such as network des...
متن کاملCS261 - Optimization Paradigms Lecture Notes for 2009-2010 Academic Year
Given a connected graph G = (V, E) with non-negative edge costs, and a set of " special " nodes S ⊂ V , a subgraph of G is a Steiner tree, if it is a tree that spans (connects) all the (" special ") nodes in S. The Steiner Tree problem is to find a Steiner Tree of minimum weight (cost). Steiner Tree is an important NP-hard problem that is often encountered in practice. Examples include design o...
متن کاملApproximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree
We consider the problem of multiple sequence alignment under a xed evolu tionary tree given a tree whose leaves are labeled by sequences nd ancestral sequences to label its internal nodes so as to minimize the total length of the tree where the length of an edge is the edit distance between the sequences labeling its endpoints We present a new polynomial time approximation algorithm for this pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1307.3822 شماره
صفحات -
تاریخ انتشار 2013